Randomized scheduling algorithm for queueing networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Randomized Scheduling Algorithm for Queueing Networks

There has recently been considerable interest in design of low-complexity, myopic, distributed and stable scheduling algorithms for constrained queueing network models that arise in the context of emerging communication networks. Here we consider two representative models. One, a queueing network model that captures randomly varying number of packets in the queues present at a collection of wir...

متن کامل

A ug 2 00 9 RANDOMIZED SCHEDULING ALGORITHM FOR QUEUEING NETWORKS

There has recently been considerable interest in design of low-complexity, myopic, distributed and stable scheduling policies for constrained queueing network models that arise in the context of emerging communication networks. Here, we consider two representative models. One, a model for the collection of wireless nodes communicating through a shared medium, that represents randomly varying nu...

متن کامل

Robust Scheduling for Queueing Networks

Robust Scheduling for Queueing Networks

متن کامل

Dynamic Scheduling of Multiclass Queueing Networks

Acknowledgements I would like to express my sincere gratitude to my advisor, Professor Jim Dai for his direction, support and feedback. His genius, patience and deep insights make it a pleasure to work with him. I also acknowledge the help and support of the other members of my committee, Professors Georgia Tech, students and faculty, for their support and help. I would especially like to thank...

متن کامل

Frame-based Fair Queueing: a New Traac Scheduling Algorithm for Packet-switched Networks

abstract In this paper we introduce and analyze frame-based fair queueing, a novel traac scheduling algorithm for packet-switched networks. The algorithm provides end-to-end delay bounds identical to those of PGPS (packet-level generalized processor sharing), without the complexity of simulating the uid-model system in the background as required in PGPS. The algorithm is therefore ideally suite...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Applied Probability

سال: 2012

ISSN: 1050-5164

DOI: 10.1214/11-aap763